An extremal problem in hypergraph coloring
نویسندگان
چکیده
منابع مشابه
On An Extremal Hypergraph Problem Of Brown, Erdös And Sós
Let fr(n, v, e) denote the maximum number of edges in an r-uniform hypergraph on n vertices, which does not contain e edges spanned by v vertices. Extending previous results of Ruzsa and Szemerédi and of Erdős, Frankl and Rödl, we partially resolve a problem raised by Brown, Erdős and Sós in 1973, by showing that for any fixed 2 ≤ k < r, we have nk−o(1) < fr(n, 3(r − k) + k + 1, 3) = o(n).
متن کاملOn an Extremal Hypergraph Problem Related to Combinatorial Batch Codes
Let n, r, k be positive integers such that 3 k < n and 2 r k 1. Let m(n, r, k) denote the maximum number of edges an r-uniform hypergraph on n vertices can have under the condition that any collection of i edges, span at least i vertices for all 1 i k. We are interested in the asymptotic nature of m(n, r, k) for fixed r and k as n!1. This problem is related to the forbidden hypergraph...
متن کاملAn extremal problem in proper (r, p)-coloring of hypergraphs
Let G(V,E) be a k-uniform hypergraph. A hyperedge e ∈ E is said to be properly (r, p) colored by an r-coloring of vertices in V if e contains vertices of at least p distinct colors in the rcoloring. An r-coloring of vertices in V is called a strong (r, p) coloring if every hyperedge e∈E is properly (r, p) colored by the r-coloring. We study the maximum number of hyperedges that can be properly ...
متن کاملHardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) 1/10−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22Ω( √ log logN) colors. Their result is obtain...
متن کاملApproximate Hypergraph Coloring
A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic. We are interested in the problem of coloring 2-colorable hypergraphs. For the special case of graphs (hypergraphs of dimension 2) this can easily be done in linear time. The problem for general hypergraphs is much more difficult since a result of Lovász implies that the problem is NP-hard even...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1977
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90007-7